Constructions and properties of block codes for partial-response channels

نویسندگان

  • Ludo M. G. M. Tolhuizen
  • Kees A. Schouhamer Immink
  • Henk D. L. Hollmann
چکیده

We report on block-coding techniques for partial-response II. PRELIMINARY channels with transfer function (1 F Dm), m = 1,2, . . We consider various constructions of block codes with prescribed min imum Euclidean Let u = (x1,... ,un) andv = (VI,..., un) be two n-tuples over distance. Upper and lower bounds to the size of a code with min imum @ = {-l,l}. Define the difference vector e = (el,...,e,+,) for squared Euclidean distance greater than unity are furnished. A table the PR channel with transfer function (1 + aDm), m = 1,2,..., is presented of cardinalities of codes of small length with prescribed min imum squared Euclidean distance. and a = ~1, as

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver

Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...

متن کامل

Matched spectral-null codes for partial-response channels

A new family of codes is described that improve the reliability of digital communication over noisy, partial-response channels. The codes are intended for use on channels where the input alphabet size is limited. These channels arise in the context of digital data recording and certain data transmission applications. The codes-called matched-spectral-null codes -satisfy the property that the fr...

متن کامل

Capacity Achieving Codes From Randomness Condensers

We give a general framework for construction of small ensembles of capacity achieving linear codes for a wide range of (not necessarily memoryless) discrete symmetric channels, and in particular, the binary erasure and symmetric channels. The main tool used in our constructions is the notion of randomness extractors and lossless condensers that are regarded as central tools in theoretical compu...

متن کامل

Performance of Turbo Codes over Magnetic Recording Channels

| We study the performance of turbo codes for magnetic recording channels using realistic channel models. Our main objective is to provide a benchmark for the future studies on the subject. We examine a variety of schemes including the use of parallel concatenated turbo codes with and without turbo equalization and convolutional codes with an interleaver (can be regarded as a serial concatenati...

متن کامل

Application of high-rate tail-biting codes to generalized partial response channels

The performance of high-rate tail-biting convolutional codes serially concatenated with generalized partial response channels is studied. The effect of precoders on the overall performance is investigated. Extrinsic information transfer charts are used to guide the selection of appropriate tail-biting codes and precoders. Simulation results for a magnetic recording system modeled as a serial co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 41  شماره 

صفحات  -

تاریخ انتشار 1995